Cluster Reduction: Deletion or Coalescence?
نویسندگان
چکیده
منابع مشابه
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting...
متن کاملCluster production with coalescence and breakup.
The problem of hadronic cluster production in quark-hadron phase transition in heavy-ion collisions is studied by cellular automata. Previous result on the scaling behavior is extended to include variation in the drift speed. It is also shown that coalescence is more important than growth in generating scaling. A new set of rules is adopted to free the clusters from being rigid. It is found tha...
متن کاملSarcomeric Pattern Formation by Actin Cluster Coalescence
Contractile function of striated muscle cells depends crucially on the almost crystalline order of actin and myosin filaments in myofibrils, but the physical mechanisms that lead to myofibril assembly remains ill-defined. Passive diffusive sorting of actin filaments into sarcomeric order is kinetically impossible, suggesting a pivotal role of active processes in sarcomeric pattern formation. Us...
متن کاملFour-body Effects in Globular Cluster Black Hole Coalescence
In the high density cores of globular clusters, multibody interactions are expected to be common, with the result that black holes in binaries are hardened by interactions. It was shown by Sigurdsson & Hernquist (1993) and others that 10M black holes interacting exclusively by three-body encounters do not merge in the clusters themselves, because recoil kicks the binaries out of the clusters be...
متن کاملEven faster parameterized cluster deletion and cluster editing
Cluster Deletion and Cluster Editing ask to transform a graph by at most k edge deletions or edge edits, respectively, into a cluster graph, i.e., disjoint union of cliques. Equivalently, a cluster graph has no conflict triples, i.e., two incident edges without a transitive edge. We solve the two problems in time O∗(1.415k) and O∗(1.76k), respectively. These results round off our earlier work b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Catalan Journal of Linguistics
سال: 2005
ISSN: 2014-9719,1695-6885
DOI: 10.5565/rev/catjl.113